Interface Splitting Algorithm: A Parallel Solution to Diagonally Dominant Tridiagonal Systems
نویسندگان
چکیده
We present an interface-splitting algorithm (ITS) for solving diagonally dominant tridiagonal systems in parallel. The construction of the ITS profits from bidirectional links modern networks, and it only needs one synchronization step to solve system. trades some necessary accuracy better parallel performance. performance are evaluated on four different machines up 2048 processors. proposed scales very well, is significantly faster than used ScaLAPACK. applicability demonstrated three-dimensional simulations turbulent channel flow at Reynolds number 41,430.
منابع مشابه
Interface Splitting Algorithm for diagonal dominant tridiagonal matrices
The interface-splitting algorithm solving diagonal dominant tridiagonal systems in parallel is presented. The algorithm requires only the nearest neighbor communication with minimum number of communications and data transfer. Unlike the existing divide and conquer algorithms solving this problem, the proposed algorithm only requires one phase of synchronisation and bidirectional links can be fu...
متن کاملParallel Solution of Narrow Banded Diagonally Dominant Linear Systems
Abstract ScaLAPACK contains a pair of routines for solving systems which are narrow banded and diagonally dominant by rows. Mathematically, the algorithm is block cyclic reduction. The ScaLAPACK implementation can be improved using incomplete, rather than complete block cyclic reduction. If the matrix is strictly dominant by rows, then the truncation error can be bounded directly in terms of th...
متن کاملDiagonally Stable Tridiagonal Switched Linear Systems
Abstract: A stability analysis is carried out for certain classes of switched linear systems with tridiagonal structure, under arbitrary switching signal. This analysis is made using diagonal common quadratic Lyapunov functions. Namely, necessary and sufficient conditions for the existence of such Lyapunov functions are proposed for second order switched systems and for third order switched sys...
متن کاملSolution of Strictly Diagonal Dominant Tridiagonal Systems on Vector Computers
24 restriction. As and , the minimum of δ (l) is achieved on the boundary of R. It is not difficult to see that this minimum is in x = y = , independently of the values of the greek letters. With this, we can see that: Now, if , we have: which allows to finish the proof: x y , () R ∈ 0 δ l 1 − () 1 − , [ ] 0 δ l 1 − () 1 − , [ ] × = x ∂ ∂δ l () 0 ≠ y ∂ ∂δ l () 0 ≠ δ l 1 − () 1 − δ l () δ l 1 − ...
متن کاملA Parallel Prefix Algorithm for Almost Toeplitz Tridiagonal Systems
A compact scheme is a discretization scheme that is advantageous in obtaining highly accurate solutions. However, the resulting systems from compact schemes are tridiagonal systems that are di cult to solve e ciently on parallel computers. Considering the almost symmetric Toeplitz structure, a parallel algorithm, simple parallel pre x (SPP), is proposed. The SPP algorithm requires less memory t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computation (Basel)
سال: 2023
ISSN: ['2079-3197']
DOI: https://doi.org/10.3390/computation11090187